Scattering amplitudes and simple canonical forms for simple polytopes
نویسندگان
چکیده
A bstract We provide an efficient recursive formula to compute the canonical forms of arbitrary d -dimensional simple polytopes, which are convex polytopes such that every vertex lies precisely on facets. For illustration purposes, we explicitly derive formulae for Stokes play a similar role theory with quartic interaction as Associahedron does in planar bi-adjoint ? 3 theory. As by-product, our also suggests new way obtain full amplitude 4 by taking suitable limits constituent polytopes.
منابع مشابه
Linear Programming, the Simplex Algorithm and Simple Polytopes
In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.
متن کاملSimple analytical representation for the high - energy Delbrück scattering amplitudes
Using a new representation for the quasiclassical Green function of the Dirac equation in a Coulomb field, analytical expressions for the high-energy small-angle Delbrück scattering amplitudes are obtained exactly in the parameter Zα. Magnitudes of the amplitudes coincide with the previous results. However, the structure of the expressions obtained is much more simple, which considerably facili...
متن کاملSimple 0/1-Polytopes
For general polytopes, it has turned out that with respect to many questions it su ces to consider only the simple polytopes, i.e., d-dimensional polytopes where every vertex is contained in only d facets. In this paper, we show that the situation is very di erent within the class of 0/1-polytopes, since every simple 0/1-polytope is the (cartesian) product of some 0/1-simplices (which proves a ...
متن کاملSimple Extensions of Polytopes
We introduce the simple extension complexity of a polytope P as the smallest number of facets of any simple (i.e., non-degenerate in the sense of linear programming) polytope which can be projected onto P . We devise a combinatorial method to establish lower bounds on the simple extension complexity and show for several polytopes that they have large simple extension complexities. These example...
متن کاملLattice Points in Simple Polytopes
P (h) φ(x)dx where the polytope P (h) is obtained from P by independent parallel motions of all facets. This extends to simple lattice polytopes the EulerMaclaurin summation formula of Khovanskii and Pukhlikov [8] (valid for lattice polytopes such that the primitive vectors on edges through each vertex of P form a basis of the lattice). As a corollary, we recover results of Pommersheim [9] and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2021
ISSN: ['1127-2236', '1126-6708', '1029-8479']
DOI: https://doi.org/10.1007/jhep03(2021)067